Interpreting Unfairness in Graph Neural Networks via Training Node Attribution
نویسندگان
چکیده
Graph Neural Networks (GNNs) have emerged as the leading paradigm for solving graph analytical problems in various real-world applications. Nevertheless, GNNs could potentially render biased predictions towards certain demographic subgroups. Understanding how bias arises is critical, it guides design of GNN debiasing mechanisms. However, most existing works overwhelmingly focus on debiasing, but fall short explaining such induced. In this paper, we study a novel problem interpreting unfairness through attributing to influence training nodes. Specifically, propose strategy named Probabilistic Distribution Disparity (PDD) measure exhibited GNNs, and develop an algorithm efficiently estimate each node bias. We verify validity PDD effectiveness estimation experiments datasets. Finally, also demonstrate proposed framework be used GNNs. Open-source code can found at https://github.com/yushundong/BIND.
منابع مشابه
Convolutional Neural Networks Via Node-Varying Graph Filters
Convolutional neural networks (CNNs) are being applied to an increasing number of problems and fields due to their superior performance in classification and regression tasks. Since two of the key operations that CNNs implement are convolution and pooling, this type of networks is implicitly designed to act on data described by regular structures such as images. Motivated by the recent interest...
متن کاملGraph Convolutional Neural Networks via Scattering
We generalize the scattering transform to graphs and consequently construct a convolutional neural network on graphs. We show that under certain conditions, any feature generated by such a network is approximately invariant to permutations and stable to graph manipulations. Numerical results demonstrate competitive performance on relevant datasets.
متن کاملTraining Recurrent Neural Networks via Trajectory Modification
Traj ectory modification of recurrent neur al networks is a training algorithm that modifies both th e network representat ions in each tim e step and th e common weight matrix. The present algorithm is a genera lization of th e energy minimization formalism for tr ainin g feed-forward networks via modifications of th e int ern al represent ati ons. In a previous paper we showed that th e same ...
متن کاملInterpreting CNN knowledge via an Explanatory Graph
This paper learns a graphical model, namely an explanatory graph, which reveals the knowledge hierarchy hidden inside a pre-trained CNN. Considering that each filter in a convlayer of a pre-trained CNN usually represents a mixture of object parts, we propose a simple yet efficient method to automatically disentangles different part patterns from each filter, and construct an explanatory graph. ...
متن کاملEffective Graph Visualization via Node Grouping
visualizes large graphs 2D drawing assumes the existence of complete or almost complete subgraphs in the graph to be visualized use of two type of techniques: force directed orthogonal drawing Levels of Abstraction total abstraction proximity abstraction explicit proximity abstraction interactive abstraction Force Directed Layout Technique with Node Grouping 1. find node grouping (by using the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2023
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v37i6.25905